Course Outline for CS 236610: Recent Advances in Algebraic and Combinatorial Coding Theory
نویسنده
چکیده
The course will cover several advanced topics in algebraic and combinatorial coding theory. One of the most exciting breakthroughs in algebraic coding theory in the past decade is a new paradigm for decoding Reed-Solomon codes using bivariate (or multivariate) polynomial interpolation. The first half of the course will be devoted to an in-depth study of this subject. The second half of the course will cover several topics of recent research in coding theory, namely: asymptotic improvements of the Gilbert-Varshamov bound; graph-cover analysis of iterative decoding, pseudo-codewords, and stopping redundancy; introduction to network coding and network code design.
منابع مشابه
Coding Theory and Algebraic Combinatorics
This chapter introduces and elaborates on the fruitful interplay of coding theory and algebraic combinatorics, with most of the focus on the interaction of codes with combinatorial designs, finite geometries, simple groups, sphere packings, kissing numbers, lattices, and association schemes. In particular, special interest is devoted to the relationship between codes and combinatorial designs. ...
متن کاملSome Algebraic and Combinatorial Properties of the Complete $T$-Partite Graphs
In this paper, we characterize the shellable complete $t$-partite graphs. We also show for these types of graphs the concepts vertex decomposable, shellable and sequentially Cohen-Macaulay are equivalent. Furthermore, we give a combinatorial condition for the Cohen-Macaulay complete $t$-partite graphs.
متن کاملAlgebra in Computational Complexity
At its core, much of Computational Complexity is concerned with combinatorial objects and structures. But it has often proven true that the best way to prove things about these combinatorial objects is by establishing a connection to a more well-behaved algebraic setting. Indeed, many of the deepest and most powerful results in Computational Complexity rely on algebraic proof techniques. The Ra...
متن کاملA convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملTissue Engineering: A Biological Solution for Tissue Damage, Loss or End Stage Organ Failure
In recent years the science of tissue engineering has emerged as a powerful tool for the development of a novel set of tissue replacement parts and technologies. Recent advances in the fields of biomaterials, stem cell technologies, growth factor field and biomimetics have created a unique set of opportunities for investigators to fabricate lab-grown tissues from combination of extracellular ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006